________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 12:23:34
Input Data from:  dataset170.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,1655
Average f[i]   :4225
Average g[i,j] :2054,90196078431
Total demand   :16420
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 69
> Selected Move:	5620	1	-1	12	4500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0    >new incumb.: 5620


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 84
> Selected Move:	7850	1	-1	9	8500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0    >new incumb.: 7850


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 93
> Selected Move:	9640	1	-1	15	13500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0    >new incumb.: 9640


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 104
> Selected Move:	10860	1	-1	14	18500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  1  0  1  1  0  0  0  0    >new incumb.: 10860


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 118
> Selected Move:	11790	1	-1	5	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  1  0  1  1  0  0  0  0    >new incumb.: 11790


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 123
> Selected Move:	11790	3	15	6	23000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 100
> Selected Move:	11680	3	5	3	24000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 94
> Selected Move:	11690	3	6	15	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 114
> Selected Move:	11590	3	3	19	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 126
> Selected Move:	11750	3	9	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 109
> Selected Move:	11740	3	15	6	24000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 107
> Selected Move:	11590	3	4	9	23000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 125
> Selected Move:	11600	3	19	11	21500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 124
> Selected Move:	11890	3	2	4	23700


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  0  1  0  1  1  0  1  0  0  0  0  0    >new incumb.: 11890


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 75
> Selected Move:	11890	4	4	6	24500


> New Y[]: 
	
	 2  3  0  0  1  0  4  0  0  1  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 69
> Selected Move:	11890	4	6	9	24800


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  4  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 65
> Selected Move:	11890	4	9	11	24300


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  4  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 67
> Selected Move:	11890	4	11	12	23800


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  1  4  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 72
> Selected Move:	11890	4	12	14	23000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  1  1  0  4  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 82
> Selected Move:	11720	3	1	5	24700


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  0  1  0  1  1  0  4  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 80
> Selected Move:	11677	4	5	14	25100


> New Y[]: 
	
	 2  0  0  0  1  4  1  0  0  1  0  1  1  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 79
> Selected Move:	11550	4	14	4	25400


> New Y[]: 
	
	 2  0  0  0  3  4  1  0  0  1  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 72
> Selected Move:	11552	4	4	5	25400


> New Y[]: 
	
	 2  0  0  0  4  3  1  0  0  1  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 73
> Selected Move:	11513	4	4	12	25500


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  0  1  0  1  4  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 70
> Selected Move:	11515	4	5	12	25500


> New Y[]: 
	
	 2  0  0  0  1  4  1  0  0  1  0  1  3  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 25 #######################


> Neighbours evaluated; 77
> Selected Move:	11388	4	5	14	25800


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  1  0  1  3  0  4  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 26 #######################


> Neighbours evaluated; 72
> Selected Move:	11426	4	12	4	25700


> New Y[]: 
	
	 2  0  0  0  3  1  1  0  0  1  0  1  1  0  4  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 27 #######################


> Neighbours evaluated; 80
> Selected Move:	11253	4	4	14	26100


> New Y[]: 
	
	 2  0  0  0  4  1  1  0  0  1  0  1  1  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 28 #######################


> Neighbours evaluated; 68
> Selected Move:	11390	3	4	2	23900


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  1  0  1  1  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 29 #######################


> Neighbours evaluated; 117
> Selected Move:	11390	4	14	5	23200


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  0  1  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 30 #######################


> Neighbours evaluated; 116
> Selected Move:	11420	3	9	19	24700


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  0  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 31 #######################


> Neighbours evaluated; 102
> Selected Move:	11430	3	5	1	23000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 32 #######################


> Neighbours evaluated; 121
> Selected Move:	11590	3	11	13	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 33 #######################


> Neighbours evaluated; 126
> Selected Move:	11660	3	14	17	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 34 #######################


> Neighbours evaluated; 125
> Selected Move:	11500	3	13	14	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 35 #######################


> Neighbours evaluated; 120
> Selected Move:	11490	3	17	8	23000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 36 #######################


> Neighbours evaluated; 115
> Selected Move:	11490	3	6	15	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 37 #######################


> Neighbours evaluated; 121
> Selected Move:	11440	3	8	11	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 38 #######################


> Neighbours evaluated; 121
> Selected Move:	11400	3	11	6	24000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 39 #######################


> Neighbours evaluated; 115
> Selected Move:	11490	3	15	10	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 40 #######################


> Neighbours evaluated; 114
> Selected Move:	11410	3	14	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 41 #######################


> Neighbours evaluated; 86
> Selected Move:	11400	3	4	15	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 42 #######################


> Neighbours evaluated; 119
> Selected Move:	11340	3	6	11	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 43 #######################


> Neighbours evaluated; 124
> Selected Move:	11340	3	15	6	24000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  1  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 44 #######################


> Neighbours evaluated; 120
> Selected Move:	11380	3	19	9	22500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  1  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 45 #######################


> Neighbours evaluated; 122
> Selected Move:	11340	3	10	3	23000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  0  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 46 #######################


> Neighbours evaluated; 103
> Selected Move:	11550	3	11	17	24500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 47 #######################


> Neighbours evaluated; 95
> Selected Move:	11490	3	3	5	23500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 48 #######################


> Neighbours evaluated; 101
> Selected Move:	11600	3	6	15	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 49 #######################


> Neighbours evaluated; 124
> Selected Move:	11460	3	5	19	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 50 #######################


> Neighbours evaluated; 127
> Selected Move:	11460	3	15	6	23500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 51 #######################


> Neighbours evaluated; 123
> Selected Move:	11310	3	9	8	23500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 52 #######################


> Neighbours evaluated; 124
> Selected Move:	11340	3	2	14	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  4  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 53 #######################


> Neighbours evaluated; 113
> Selected Move:	11450	3	8	18	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  0  4  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 54 #######################


> Neighbours evaluated; 106
> Selected Move:	11555	3	14	13	25300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  4  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 55 #######################


> Neighbours evaluated; 105
> Selected Move:	11384	4	13	19	25800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  1  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 56 #######################


> Neighbours evaluated; 101
> Selected Move:	11348	3	13	14	25300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  1  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 57 #######################


> Neighbours evaluated; 105
> Selected Move:	11420	3	17	11	23800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  0  1  0  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 58 #######################


> Neighbours evaluated; 104
> Selected Move:	11500	3	19	9	23800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  4  0  1  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 59 #######################


> Neighbours evaluated; 96
> Selected Move:	11500	4	9	6	23500


> New Y[]: 
	
	 2  3  0  0  0  0  4  0  0  1  0  1  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 60 #######################


> Neighbours evaluated; 93
> Selected Move:	11530	3	11	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  4  0  0  1  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 61 #######################


> Neighbours evaluated; 83
> Selected Move:	11530	4	6	5	23200


> New Y[]: 
	
	 2  3  0  0  0  4  1  0  0  1  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 62 #######################


> Neighbours evaluated; 90
> Selected Move:	11530	4	5	12	24300


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  0  0  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 63 #######################


> Neighbours evaluated; 87
> Selected Move:	11530	4	12	14	23500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  0  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 64 #######################


> Neighbours evaluated; 88
> Selected Move:	11500	3	5	11	22000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  1  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 65 #######################


> Neighbours evaluated; 101
> Selected Move:	11500	4	14	11	23300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  4  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 66 #######################


> Neighbours evaluated; 96
> Selected Move:	11500	4	11	12	22800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  1  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 67 #######################


> Neighbours evaluated; 98
> Selected Move:	11500	4	12	18	23700


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  1  1  0  1  0  0  0  4  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 68 #######################


> Neighbours evaluated; 98
> Selected Move:	11474	3	11	5	25200


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  0  0  1  0  1  0  0  0  4  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 69 #######################


> Neighbours evaluated; 86
> Selected Move:	11448	4	18	9	25300


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  4  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 70 #######################


> Neighbours evaluated; 91
> Selected Move:	11289	3	9	19	25300


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  1  0  1  0  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 71 #######################


> Neighbours evaluated; 98
> Selected Move:	11400	3	5	15	24800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  0  1  1  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,26

## ITERATION 72 #######################


> Neighbours evaluated; 94
> Selected Move:	11420	3	6	11	24800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  0  1  1  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 73 #######################


> Neighbours evaluated; 107
> Selected Move:	11420	4	19	14	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  0  4  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 74 #######################


> Neighbours evaluated; 110
> Selected Move:	11420	3	15	6	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  0  4  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 75 #######################


> Neighbours evaluated; 101
> Selected Move:	11430	3	18	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  1  1  0  4  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,24

## ITERATION 76 #######################


> Neighbours evaluated; 97
> Selected Move:	11500	3	11	17	26000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  1  0  4  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 77 #######################


> Neighbours evaluated; 109
> Selected Move:	11435	4	14	19	26300


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  1  0  1  0  0  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 78 #######################


> Neighbours evaluated; 110
> Selected Move:	11430	3	17	11	24800


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  1  1  0  1  0  0  0  0  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,235

## ITERATION 79 #######################


> Neighbours evaluated; 97
> Selected Move:	11383	4	19	4	25200


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  0  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 80 #######################


> Neighbours evaluated; 95
> Selected Move:	11374	3	4	18	25200


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  0  1  0  0  0  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 81 #######################


> Neighbours evaluated; 98
> Selected Move:	11420	4	18	6	25000


> New Y[]: 
	
	 2  3  0  0  0  0  4  0  0  0  0  1  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 82 #######################


> Neighbours evaluated; 97
> Selected Move:	11420	4	6	11	24800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  4  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 83 #######################


> Neighbours evaluated; 96
> Selected Move:	11420	4	11	12	24300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  4  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 84 #######################


> Neighbours evaluated; 98
> Selected Move:	11367	3	18	4	25300


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  1  4  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 85 #######################


> Neighbours evaluated; 98
> Selected Move:	11353	3	11	17	26800


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  4  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 86 #######################


> Neighbours evaluated; 106
> Selected Move:	11410	4	12	17	26500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  1  0  1  0  0  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 87 #######################


> Neighbours evaluated; 108
> Selected Move:	11358	4	17	4	26700


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  0  0  0  0  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 88 #######################


> Neighbours evaluated; 107
> Selected Move:	11269	3	14	11	25700


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  0  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,235

## ITERATION 89 #######################


> Neighbours evaluated; 85
> Selected Move:	11600	3	19	9	24200


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  0  1  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 90 #######################


> Neighbours evaluated; 84
> Selected Move:	11600	4	4	6	25000


> New Y[]: 
	
	 2  3  0  0  1  0  4  0  0  1  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 91 #######################


> Neighbours evaluated; 77
> Selected Move:	11600	4	6	11	24800


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  4  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 92 #######################


> Neighbours evaluated; 76
> Selected Move:	11600	4	11	12	24300


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  1  4  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 93 #######################


> Neighbours evaluated; 79
> Selected Move:	11600	4	12	17	24000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  1  1  0  0  0  0  4  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 94 #######################


> Neighbours evaluated; 85
> Selected Move:	11610	3	6	15	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  1  0  0  1  0  4  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 95 #######################


> Neighbours evaluated; 103
> Selected Move:	11670	3	17	14	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  1  0  4  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 96 #######################


> Neighbours evaluated; 110
> Selected Move:	11670	4	14	4	24700


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 97 #######################


> Neighbours evaluated; 102
> Selected Move:	11670	4	4	12	24800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  4  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 98 #######################


> Neighbours evaluated; 101
> Selected Move:	11670	4	12	15	24800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  1  0  1  4  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 99 #######################


> Neighbours evaluated; 103
> Selected Move:	11600	4	15	11	25300


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  4  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 100 #######################


> Neighbours evaluated; 102
> Selected Move:	11486	4	11	9	25800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  4  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 101 #######################


> Neighbours evaluated; 110
> Selected Move:	11318	3	14	17	26300


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  4  0  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 102 #######################


> Neighbours evaluated; 100
> Selected Move:	11566	4	9	4	25200


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  1  0  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 103 #######################


> Neighbours evaluated; 102
> Selected Move:	11546	4	4	12	25300


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  4  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 104 #######################


> Neighbours evaluated; 101
> Selected Move:	11544	4	12	15	25300


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  1  0  0  4  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 105 #######################


> Neighbours evaluated; 102
> Selected Move:	11430	4	15	11	25800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  4  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 106 #######################


> Neighbours evaluated; 110
> Selected Move:	11292	3	11	16	25600


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  1  0  0  1  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 107 #######################


> Neighbours evaluated; 105
> Selected Move:	11430	4	16	17	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  1  0  0  1  1  4  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 108 #######################


> Neighbours evaluated; 106
> Selected Move:	11420	3	15	6	24000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  0  1  0  0  0  1  4  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 109 #######################


> Neighbours evaluated; 100
> Selected Move:	11510	3	17	14	23000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  0  1  0  4  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 110 #######################


> Neighbours evaluated; 101
> Selected Move:	11510	4	14	4	23700


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  0  1  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 111 #######################


> Neighbours evaluated; 100
> Selected Move:	11510	4	4	6	24500


> New Y[]: 
	
	 2  3  0  0  1  0  4  0  0  1  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 112 #######################


> Neighbours evaluated; 96
> Selected Move:	11510	4	6	9	24800


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  4  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 113 #######################


> Neighbours evaluated; 94
> Selected Move:	11510	4	9	12	23800


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  0  4  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 114 #######################


> Neighbours evaluated; 98
> Selected Move:	11510	4	12	16	24100


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  0  1  0  1  0  4  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 115 #######################


> Neighbours evaluated; 99
> Selected Move:	11420	3	14	17	24600


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  0  1  0  0  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 116 #######################


> Neighbours evaluated; 94
> Selected Move:	11420	4	16	4	24200


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  0  1  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 117 #######################


> Neighbours evaluated; 97
> Selected Move:	11420	4	4	6	25000


> New Y[]: 
	
	 2  3  0  0  1  0  4  0  0  1  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 118 #######################


> Neighbours evaluated; 90
> Selected Move:	11420	4	6	12	24300


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  0  4  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 119 #######################


> Neighbours evaluated; 97
> Selected Move:	11363	3	6	15	25300


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  4  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 120 #######################


> Neighbours evaluated; 105
> Selected Move:	11400	3	17	14	24800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  4  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 121 #######################


> Neighbours evaluated; 114
> Selected Move:	11400	4	12	4	24700


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  1  0  0  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 122 #######################


> Neighbours evaluated; 114
> Selected Move:	11400	4	4	14	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  1  0  4  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 123 #######################


> Neighbours evaluated; 116
> Selected Move:	11400	4	14	15	24800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  1  0  1  4  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 124 #######################


> Neighbours evaluated; 112
> Selected Move:	11380	4	15	16	25100


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  1  0  1  1  4  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 125 #######################


> Neighbours evaluated; 113
> Selected Move:	11251	3	16	5	25200


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  0  1  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 126 #######################


> Neighbours evaluated; 95
> Selected Move:	11480	3	4	18	24200


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  1  0  0  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 127 #######################


> Neighbours evaluated; 111
> Selected Move:	11480	4	5	14	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  1  0  4  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 128 #######################


> Neighbours evaluated; 111
> Selected Move:	11426	4	14	12	25300


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  4  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 129 #######################


> Neighbours evaluated; 112
> Selected Move:	11428	4	12	15	25300


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  1  0  1  4  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 130 #######################


> Neighbours evaluated; 109
> Selected Move:	11276	4	15	18	26200


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  1  0  1  1  0  0  4  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 131 #######################


> Neighbours evaluated; 105
> Selected Move:	11253	4	18	9	26300


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  4  0  0  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 132 #######################


> Neighbours evaluated; 109
> Selected Move:	11096	3	9	19	26300


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  0  1  1  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 133 #######################


> Neighbours evaluated; 104
> Selected Move:	11280	3	5	9	24800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  1  0  1  1  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 134 #######################


> Neighbours evaluated; 117
> Selected Move:	11330	3	15	6	23800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  1  0  1  0  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 135 #######################


> Neighbours evaluated; 114
> Selected Move:	11330	4	19	6	25000


> New Y[]: 
	
	 2  3  0  0  0  0  4  0  0  1  0  0  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 136 #######################


> Neighbours evaluated; 116
> Selected Move:	11330	4	6	12	24300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  4  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 137 #######################


> Neighbours evaluated; 116
> Selected Move:	11339	3	9	15	25300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  4  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,21

## ITERATION 138 #######################


> Neighbours evaluated; 97
> Selected Move:	11400	4	12	14	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  0  4  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,215

## ITERATION 139 #######################


> Neighbours evaluated; 96
> Selected Move:	11370	3	15	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  1  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 140 #######################


> Neighbours evaluated; 96
> Selected Move:	11370	4	14	5	24700


> New Y[]: 
	
	 2  3  0  0  0  4  1  0  0  0  0  0  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 141 #######################


> Neighbours evaluated; 96
> Selected Move:	11380	3	5	2	23000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 142 #######################


> Neighbours evaluated; 119
> Selected Move:	11390	3	18	3	25500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 143 #######################


> Neighbours evaluated; 107
> Selected Move:	11390	3	3	5	24500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 144 #######################


> Neighbours evaluated; 100
> Selected Move:	11360	3	19	13	24500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 145 #######################


> Neighbours evaluated; 114
> Selected Move:	11430	3	14	17	25000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 146 #######################


> Neighbours evaluated; 111
> Selected Move:	11450	3	5	3	26000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 147 #######################


> Neighbours evaluated; 113
> Selected Move:	11420	3	17	11	24500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 148 #######################


> Neighbours evaluated; 116
> Selected Move:	11345	3	11	14	25500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 149 #######################


> Neighbours evaluated; 113
> Selected Move:	11380	3	13	15	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 150 #######################


> Neighbours evaluated; 114
> Selected Move:	11410	1	-1	9	29000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 151 #######################


> Neighbours evaluated; 127
> Selected Move:	11940	1	-1	11	33000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 152 #######################


> Neighbours evaluated; 134
> Selected Move:	11900	3	3	8	30500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 153 #######################


> Neighbours evaluated; 138
> Selected Move:	11870	3	14	5	31000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 154 #######################


> Neighbours evaluated; 123
> Selected Move:	11900	3	8	18	31000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1  0  1  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 155 #######################


> Neighbours evaluated; 134
> Selected Move:	11755	3	18	14	32000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,18

## ITERATION 156 #######################


> Neighbours evaluated; 132
> Selected Move:	11730	3	1	3	34500


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  0  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 157 #######################


> Neighbours evaluated; 125
> Selected Move:	11646	4	3	5	34700


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  0  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 158 #######################


> Neighbours evaluated; 125
> Selected Move:	11464	4	5	14	35400


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  0  1  0  1  1  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 159 #######################


> Neighbours evaluated; 124
> Selected Move:	11354	4	14	15	35700


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  0  1  0  1  1  0  1  3  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 160 #######################


> Neighbours evaluated; 123
> Selected Move:	11280	4	15	12	35800


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  0  1  0  1  3  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 161 #######################


> Neighbours evaluated; 122
> Selected Move:	11124	4	12	11	36300


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  0  1  0  3  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 162 #######################


> Neighbours evaluated; 121
> Selected Move:	10962	4	11	9	36800


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  0  3  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 163 #######################


> Neighbours evaluated; 120
> Selected Move:	10860	4	9	6	37000


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  0  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 164 #######################


> Neighbours evaluated; 121
> Selected Move:	10888	3	6	7	36600


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  0  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,225

## ITERATION 165 #######################


> Neighbours evaluated; 117
> Selected Move:	10883	2	3	-1	30100


> New Y[]: 
	
	 2  0  4  0  0  1  0  3  0  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 166 #######################


> Neighbours evaluated; 125
> Selected Move:	11400	3	7	1	28000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 167 #######################


> Neighbours evaluated; 123
> Selected Move:	11620	3	15	6	27000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 168 #######################


> Neighbours evaluated; 117
> Selected Move:	11840	3	5	4	26500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 169 #######################


> Neighbours evaluated; 119
> Selected Move:	11708	3	4	8	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 170 #######################


> Neighbours evaluated; 129
> Selected Move:	11635	3	8	18	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  1  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 171 #######################


> Neighbours evaluated; 125
> Selected Move:	11488	3	18	15	26500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 172 #######################


> Neighbours evaluated; 125
> Selected Move:	11620	3	14	8	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 173 #######################


> Neighbours evaluated; 131
> Selected Move:	11473	3	9	14	26500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 174 #######################


> Neighbours evaluated; 131
> Selected Move:	11520	3	11	19	28000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 175 #######################


> Neighbours evaluated; 122
> Selected Move:	11403	3	12	11	27500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  1  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 176 #######################


> Neighbours evaluated; 125
> Selected Move:	11230	3	15	12	27000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 177 #######################


> Neighbours evaluated; 127
> Selected Move:	11320	3	8	9	27000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 178 #######################


> Neighbours evaluated; 126
> Selected Move:	11455	3	19	16	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  1  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 179 #######################


> Neighbours evaluated; 128
> Selected Move:	11488	3	11	4	26500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 180 #######################


> Neighbours evaluated; 122
> Selected Move:	11410	3	4	8	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 181 #######################


> Neighbours evaluated; 132
> Selected Move:	11338	3	8	18	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  0  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 182 #######################


> Neighbours evaluated; 131
> Selected Move:	11330	2	18	-1	21500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 183 #######################


> Neighbours evaluated; 120
> Selected Move:	11230	3	2	18	23700


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  1  0  1  0  1  0  4  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 184 #######################


> Neighbours evaluated; 117
> Selected Move:	11266	3	16	19	25200


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  1  0  1  0  0  0  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 185 #######################


> Neighbours evaluated; 108
> Selected Move:	11330	4	18	14	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  1  0  4  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 186 #######################


> Neighbours evaluated; 111
> Selected Move:	11330	3	9	13	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  1  4  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 187 #######################


> Neighbours evaluated; 101
> Selected Move:	11330	4	14	13	24800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  4  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 188 #######################


> Neighbours evaluated; 104
> Selected Move:	11298	3	13	15	25300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  0  1  4  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,345

## ITERATION 189 #######################


> Neighbours evaluated; 89
> Selected Move:	11317	3	6	11	25300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  0  1  4  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 190 #######################


> Neighbours evaluated; 103
> Selected Move:	11315	4	15	12	25300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  4  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 191 #######################


> Neighbours evaluated; 104
> Selected Move:	11174	3	11	9	25300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  4  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 192 #######################


> Neighbours evaluated; 113
> Selected Move:	11280	4	12	14	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  1  0  4  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 193 #######################


> Neighbours evaluated; 115
> Selected Move:	11180	3	9	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  0  4  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 194 #######################


> Neighbours evaluated; 115
> Selected Move:	11230	3	15	6	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  4  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 195 #######################


> Neighbours evaluated; 112
> Selected Move:	11240	3	8	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  1  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 196 #######################


> Neighbours evaluated; 110
> Selected Move:	11240	4	14	19	24800


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  1  0  1  0  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 197 #######################


> Neighbours evaluated; 109
> Selected Move:	11230	3	4	8	23800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  1  0  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 198 #######################


> Neighbours evaluated; 112
> Selected Move:	11235	3	18	17	25300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  1  0  0  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 199 #######################


> Neighbours evaluated; 112
> Selected Move:	11220	3	14	18	24300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  1  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 200 #######################


> Neighbours evaluated; 114
> Selected Move:	11330	3	8	9	24300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0  1  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 201 #######################


> Neighbours evaluated; 116
> Selected Move:	11330	4	19	12	24800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  4  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 202 #######################


> Neighbours evaluated; 118
> Selected Move:	11330	4	12	17	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0  4  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 203 #######################


> Neighbours evaluated; 117
> Selected Move:	11335	3	9	13	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 204 #######################


> Neighbours evaluated; 101
> Selected Move:	11290	3	13	14	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  4  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 205 #######################


> Neighbours evaluated; 98
> Selected Move:	11236	3	17	9	25300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  4  0  0  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 206 #######################


> Neighbours evaluated; 106
> Selected Move:	11230	3	19	16	23800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  4  0  0  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 207 #######################


> Neighbours evaluated; 116
> Selected Move:	11230	4	9	6	23500


> New Y[]: 
	
	 2  3  0  0  0  0  4  0  0  1  0  0  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 208 #######################


> Neighbours evaluated; 115
> Selected Move:	11230	4	6	12	22800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  4  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 209 #######################


> Neighbours evaluated; 114
> Selected Move:	11230	4	12	14	22000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  1  0  4  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 210 #######################


> Neighbours evaluated; 113
> Selected Move:	11230	4	14	16	23100


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  1  0  1  0  4  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 211 #######################


> Neighbours evaluated; 112
> Selected Move:	11150	3	9	19	24600


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  0  1  0  4  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 212 #######################


> Neighbours evaluated; 100
> Selected Move:	11184	3	16	4	25200


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  0  0  0  0  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,275

## ITERATION 213 #######################


> Neighbours evaluated; 106
> Selected Move:	11158	4	4	12	25300


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  4  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,27
________________________________________________________________

Best solution found: 11890
Run Termination time: 31.01.2010 12:32:41
Run duration: 00:09:06.7656250
________________________________________________________________
